higher predicate calculus

higher predicate calculus
исчисление предикатов высших порядков

English-Russian dictionary of computer science and programming. 2013.

Игры ⚽ Нужно решить контрольную?

Смотреть что такое "higher predicate calculus" в других словарях:

  • predicate calculus — Logic. See functional calculus. Also called predicate logic. [1945 50] * * * Part of modern symbolic logic which systematically exhibits the logical relations between propositions involving quantifiers such as all and some. The predicate calculus …   Universalium

  • predicate calculus — The logical calculus in which the expressions include predicate letters, variables, and quantifiers, names, and operation letters, as well as the expressions for truth functions and the propositional variables of the propositional calculus . The… …   Philosophy dictionary

  • Predicate variable — In first order logic, a predicate variable is a predicate letter which can stand for a relation (between terms) but which has not been specifically assigned any particular relation (or meaning). In first order logic (FOL) they can be more… …   Wikipedia

  • Calculus of constructions — The calculus of constructions (CoC) is a higher order typed lambda calculus, initially developed by Thierry Coquand, where types are first class values. It is thus possible, within the CoC, to define functions from, say, integers to types, types… …   Wikipedia

  • Predicate transformer semantics — is an extension of Floyd Hoare Logic invented by Dijkstra and extended and refined by other researchers. It was first introduced in Dijkstra s paper Guarded commands, nondeterminacy and formal derivation of programs . It is a method for defining… …   Wikipedia

  • Higher-order logic — In mathematics, higher order logic is distinguished from first order logic in a number of ways.One of these is the type of variables appearing in quantifications; in first order logic, roughly speaking, it is forbidden to quantify over predicates …   Wikipedia

  • Predicate functor logic — In mathematical logic, predicate functor logic (PFL) is one of several ways to express first order logic (formerly known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic… …   Wikipedia

  • Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… …   Wikipedia

  • functional calculus — noun a system of symbolic logic that represents individuals and predicates and quantification over individuals (as well as the relations between propositions) • Syn: ↑predicate calculus • Hypernyms: ↑symbolic logic, ↑mathematical logic, ↑formal… …   Useful english dictionary

  • First-order predicate — A first order predicate (also called a monad) is a predicate that takes only individual(s) constants or variables as argument(s). Compare second order predicate and higher order predicate. ee also*First order predicate calculus *Monadic predicate …   Wikipedia

  • Lambda calculus — In mathematical logic and computer science, lambda calculus, also written as λ calculus, is a formal system designed to investigate function definition, function application and recursion. It was introduced by Alonzo Church and Stephen Cole… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»